Propositional discourse logic
نویسندگان
چکیده
A novel normal form for propositional theories underlies the logic pdl, which captures some essential features of natural discourse, independent from any particular subject matter and related only to its referential structure. In particular, pdl allows to distinguish vicious circularity from the innocent one, and to reason in the presence of inconsistency using a minimal number of extraneous assumptions, beyond the classical ones. Several, formally equivalent decision problems are identified as potential applications: non-paradoxical character of discourses, admissibility of arguments in argumentation networks, propositional satisfiability, and the existence of kernels of directed graphs. Directed graphs provide the basis for the semantics of pdl and the paper concludes by an overview of relevant graph-theoretical results and their applications in diagnosing paradoxical character of natural discourses.
منابع مشابه
Equality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملAlvarez 1 NEW SYNTACTICAL ELEMENTS IN PREDICATE LOGIC
Predicate logic is propositional logic with several new symbol types described below. These additional symbols give predicate logic greater expressive power than propositional logic. Specifically, the new symbols allow predicate logic statements to differentiate among individual objects in some domain of discourse, to refer to properties of objects or tuples of objects, and to quantify the scop...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملExclusively Indexical Deduction
This paper presents a proof system for discourse representation theoretic reasoning and dynamic predicate logical inference. It gives a sound and complete characterization of the dynamic declaration of discourse referents and the essentially indexical means to refer back to them. The indexical outlook upon discourse reference is argued to further our understanding of some issues deemed relevant...
متن کاملFirst-order logic - Wikipedia, the free encyclopedia
First-order logic (FOL) is a formal deductive system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first-order predicate calculus (FOPC), the lower predicate calculus, the language of first-order logic or predicate logic. Unlike natural languages such as English, FOL uses a wholly unambiguous formal language interpreted by mathematical str...
متن کاملCognitive Binary Logic - The Natural Unified Formal Theory of Propositional Binary Logic
This paper presents a formal theory which describes propositional binary logic as a semantically closed formal language, and allows for syntactically and semantically well-formed formulae, formal proofs (demonstrability in Hilbertian acception), deduction (Gentzen’s view of demonstrability), CNF-ization, and deconstruction to be expressed and tested in the same (computational) formal language, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Synthese
دوره 191 شماره
صفحات -
تاریخ انتشار 2014